FindShortestTour

FindShortestTour[{v1,v2,…}] attempts to find an ordering of the vi that minimizes the total distance on a tour that visits all the vi once.

FindShortestTour[graph] attempts to find an ordering of the vertices in graph that minimizes the total length when visiting each vertex once.

FindShortestTour[{v1,v2,…},j,k] finds an ordering of the vi that minimizes the total distance on a path from vj to vk.

FindShortestTour[graph,s,t] finds an ordering of the vertices that minimizes the total length on a path from s to t.

FindShortestTour[{v->w,…},…] uses rules v->w to specify the graph g. 

FindShortestTour[data->prop,…] gives the property prop for data.

Please visit the official Wolfram Language Reference for more details and examples on core symbols.